Airline planning benchmark problems—Part I:
نویسندگان
چکیده
منابع مشابه
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data
This paper is the first of two papers entitled “Airline Planning Benchmark Problems”, aimed at developing benchmark data that can be used to stimulate innovation in airline planning, in particular, in flight schedule design and fleet assignment. While optimisation has made an enormous contribution to airline planning in general, the area suffers from a lack of standardised data and benchmark pr...
متن کاملIntegrated Airline Planning
The tactical planning process of an airline is typically decomposed into several stages among which fleeting, aircraft routing, and crew pairing form the core. In such a decomposed and sequential approach the output of fleeting forms the input to aircraft routing and crew pairing. In turn, the output to aircraft routing is part of the input to crew pairing. Due to the decomposition, the resulti...
متن کاملAirline planning benchmark problems - Part II: Passenger groups, utility and demand allocation
This paper is the second of two papers entitled “Airline Planning Benchmark Problems”, aimed at developing benchmark data that can be used to stimulate innovation in airline planning, in particular, in flight schedule design and fleet assignment. The former has, to date, been under-represented in the optimization literature, due in part to the difficulty of obtaining data that adequately reflec...
متن کاملOperational airline reserve crew planning
Airlines are continually faced with the challenge of efficient utilization of their cockpit crew resources. In addition to regular flying crews, some airlines have to maintain significant reserve staffing levels to meet contractual obligations and provide smooth daily operations. Reserve crews are required to cover trips remaining unassigned due to disruptions during daily operations. Airlines ...
متن کاملRandomization in Constraint Programming for Airline Planning
We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to real-world instances of the tail assignment problem, a certain kind of airline planning problem. We analyze the performance impact of these extensions and, in order to exploit the improvements, add restarts to the search proced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2013
ISSN: 0305-0548
DOI: 10.1016/j.cor.2012.02.012